Using interaction networks for visualisation of message passing
نویسندگان
چکیده
منابع مشابه
Performance Visualisation of Message Passing Programs Using Relational Approach
Designing an efficient parallel program usually involves iteration of performance tuning. During this process a very large amount of performance data is produced. Without a proper software tool, the process of performance tuning can be very complicated and tedious. In this paper we describe a performance tuning tool for message passing programs. Our tool uses a relational approach to organise t...
متن کاملParallel Program Visualisation for a Message-Passing System
Designing parallel programs for message-passing systems is not an easy task. Difficulties arise largely due to human limitations in identifying relationships between simultaneously executed program components, or processes, and between the data computed by these processes. This paper presents a parallel program visualisation tool, Visputer, that provides the ability to graphically design and ed...
متن کاملDeep Packet Inspection Using Message Passing Networks
We propose a solution based on message passing bipartite networks, for deep packet inspection, which addresses both speed and memory issues, which are limiting factors in current solutions. We report on a preliminary implementation and propose a parallel architecture. 1 The Problem, Our Solution and Results Packet content scanning at high speed is crucial to network security and network monitor...
متن کاملDistributed MVDR Beamforming for (Wireless) Microphone Networks Using Message Passing
In this paper we present a distributed algorithm for MVDR beamforming which is based on message passing. The message-passing algorithm performs generalized linear-coordinate descent (GLiCD) operations to exchange messages between neighboring microphone nodes, which converges increasingly fast as the noise correlation matrix becomes more and more diagonal. The algorithm makes use of a trade-off ...
متن کاملBiclustering Using Message Passing
Biclustering is the analog of clustering on a bipartite graph. Existent methods infer biclusters through local search strategies that find one cluster at a time; a common technique is to update the row memberships based on the current column memberships, and vice versa. We propose a biclustering algorithm that maximizes a global objective function using message passing. Our objective function c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCSE Bulletin
سال: 1997
ISSN: 0097-8418
DOI: 10.1145/268085.268192